Models of computation - PDFSEARCH.IO - Document Search Engine

Models of computation
Results: 1716

#	Item
271	Notes on Counting with Finite Machines Dmitry Chistikov Max Planck Institute for Software Systems (MPI-SWS) Kaiserslautern and Saarbrücken, Germany Add to Reading List Source URL: drops.dagstuhl.de Language: English - Date: 2014-12-11 10:15:34 Theoretical computer science Computer science Nested word Pushdown automaton Deterministic pushdown automaton Turing machine Nondeterministic finite automaton SC Deterministic finite automaton Automata theory Theory of computation Models of computation
272	JMLR: Workshop and Conference Proceedings 34:79–93, 2014 Proceedings of the 12th ICGI An Abstract Framework for Counterexample Analysis in Active Automata Learning Add to Reading List Source URL: jmlr.org Language: English - Date: 2014-08-26 06:56:50 Computer science Software engineering Deterministic finite automaton Nondeterministic finite automaton Symbol Counterexample Regular expression Automata theory Models of computation Theoretical computer science
273	UTP Theories of Undefinedness Jim Woodcock & Victor Bandur University of York UTP Symposium, Paris: 27 August Add to Reading List Source URL: utp12.lri.fr Language: English - Date: 2012-08-27 02:26:18 Computability theory Formal methods Model theory Models of computation Lambda calculus Predicate Interpretation Function Primitive recursive function Logic Mathematical logic Mathematics
274	Quantum computing with electrical circuits: Hamiltonian construction for basic qubit-resonator models Michael R. Geller Department of Physics and Astronomy, University of Georgia, Athens, Georgia 30602, USA June 4, 2007 Add to Reading List Source URL: www.physast.uga.edu Language: English - Date: 2009-06-11 18:39:25 Quantum mechanics Superconductivity Quantum electronics Models of computation Phase qubit Qubit Quantum computer Charge qubit Josephson effect Physics Quantum information science Theoretical computer science
275	12 Informed learners T Understanding is compression, comprehension is compression! Add to Reading List Source URL: pagesperso.lina.univ-nantes.fr Language: English - Date: 2010-07-20 08:11:04 Computer science Software engineering Finite-state machine GOLD Computing Automata theory Models of computation Deterministic finite automaton
276	Complete Completion using Types and Weights Tihomir Gvero Viktor Kuncak Ivan Kuraj ´ Ecole Add to Reading List Source URL: lara.epfl.ch Language: English - Date: 2013-04-07 11:25:49 Programming language theory Proof theory Logic in computer science Models of computation Curry–Howard correspondence Philosophy of computer science Symbol Lambda calculus Monad Theoretical computer science Computer science Type theory
277	International Journal of Foundations of Computer Science c World Scientific Publishing Company Semi-Automatic Distributed Synthesis Add to Reading List Source URL: cgi.csc.liv.ac.uk Language: English - Date: 2006-11-06 14:37:29 Models of computation Automata theory Finite-state machine
278	work (5). A contact network is a directed graph with a single special source s and a single special sink t. Each edge is labeled with either x or 2, where x is some variahle. Given any assignment of values to the variabl Add to Reading List Source URL: binds.cs.umass.edu Language: English - Date: 2014-12-01 15:40:28 Computability theory Turing machine Alan Turing Models of computation Hypercomputation Computability Computational complexity theory Church–Turing thesis Hava Siegelmann Theoretical computer science Computer science Theory of computation
279	A New-Millenium Attack on the Busy Beaver Problem∗ Kyle Ross, Owen Kellett, Bram van Heuveln, Selmer Bringsjord Rensselaer AI & Reasoning (RAIR) Lab Department of Cognitive Science Department of Computer Sciencee Renss Add to Reading List Source URL: www.cogsci.rpi.edu Language: English - Date: 2006-06-19 14:20:06 Turing machine Computer science Models of computation Busy beaver Computability Halting problem Algorithm Finite-state machine Description number Theory of computation Computability theory Theoretical computer science
280	PHYSICAL REVIEW B 90, Compressed sensing quantum process tomography for superconducting quantum gates Andrey V. Rodionov,1 Andrzej Veitia,1 R. Barends,2 J. Kelly,2 Daniel Sank,2 J. Wenner,2 John M. Martini Add to Reading List Source URL: www.ee.ucr.edu Language: English - Date: 2014-10-10 15:04:57 Quantum information science Linear algebra Information theory Models of computation Quantum mechanics Quantum computer Qubit Quantum gate Compressed sensing Theoretical computer science Algebra Mathematics

UPDATE